package com.banmao.algorithm.No501To700.No617;

public class Answer {

    public static void main(String[] args) {

        Solution1 solution = new Solution1();

        TreeNode root1 = new TreeNode(1, new TreeNode(3, new TreeNode(5), null), new TreeNode(2));

        TreeNode root2 = new TreeNode(2, new TreeNode(1, null, new TreeNode(4)), new TreeNode(3, null, new TreeNode(7)));

        TreeNode treeNode = solution.mergeTrees(root1, root2);

        System.out.println(treeNode);

    }

}
